A New Proof of Monotonicity for Extended Mean Values

نویسندگان

  • FENG QI
  • LOKENATH DEBNATH
چکیده

In this article, a new proof of monotonicity for extended mean values is given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Proof of FDR Control Based on Forward Filtration

For multiple testing problems, Benjamini and Hochberg (1995) proposed the false discovery rate (FDR) as an alternative to the family-wise error rate (FWER). Since then, researchers have provided many proofs to control the FDR under different assumptions. Storey et al. (2004) showed that the rejection threshold of a BH step-up procedure is a stopping time with respect to the reverse filtration g...

متن کامل

Complete Monotonicity of Logarithmic Mean

In the article, the logarithmic mean is proved to be completely monotonic and an open problem about the logarithmically complete monotonicity of the extended mean values is posed.

متن کامل

Another proof of Banaschewski's surjection theorem

We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...

متن کامل

Inferences for Extended Generalized Exponential Distribution based on Order Statistics

‎Recently‎, ‎a new distribution‎, ‎named as extended generalized exponential distribution‎, ‎has been introduced by Kundu and Gupta (2011). ‎In this paper‎, ‎we consider the extended generalized exponential distribution with known shape parameters α and β. ‎At first‎, ‎the exact expressions for marginal and product moments of o...

متن کامل

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999